A Successive Underestimation Method for Concave Minimization Problems

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. INFORMS is collaborating with JSTOR to digitize, preserve and extend access to Mathematics of Operations Research. A new method designed to globally minimize concave functions over linear polyhedra is described. Properties of the method are discussed, an example problem is solved, and computational considerations are discussed.